Ranking intersecting distribution functions
نویسندگان
چکیده
Second?degree dominance has become a widely accepted criterion for ordering distribution functions according to social welfare. However, it provides only partial ordering, and may fail rank distributions that intersect. To intersecting functions, we propose general approach based on rank?dependent theory. This avoids making arbitrary restrictions or parametric assumptions about welfare allows researchers identify the weakest set of needed Our is two complementary sequences nested criteria. The first (second) sequence extends second?degree stochastic by placing more emphasis differences occur in lower (upper) part distribution. characterize separate systems subfamilies functions. us least restrictive preferences give an unambiguous ranking given We also provide axiomatization criteria corresponding show usefulness our using empirical applications; assesses implications changes household income over business cycle, while second performs comparison actual counterfactual outcome from policy experiment.
منابع مشابه
Unambiguous Comparison of Intersecting Distribution Functions∗
Comparing distribution functions is a key task in descriptive research and policy evaluation. In many applications, a reasonable refinement of second-degree stochastic dominance criterion is necessary to attain unambigous ranking of intersecting distribution functions. Although the literature offers dominance criteria of third or higher degree, these ranking criteria are rarely used because the...
متن کاملRanking intersecting Lorenz curves
Ranking Intersecting Lorenz Curves This paper is concerned with the problem of ranking Lorenz curves in situations where the Lorenz curves intersect and no unambiguous ranking can be attained without introducing weaker ranking criteria than first-degree Lorenz dominance. To deal with such situations two alternative sequences of nested dominance criteria between Lorenz curves are introduced. At ...
متن کاملRanking Functions
The literature on knowledge, belief, and uncertainty in artificial intelligence is divided into two broad classes. In epistemic logic (Hintikka 1961, Halpern & Fagin & Moses & Vardi 1995), belief revision theory (Alchourrón & Gärdenfors & Makinson 1985, Gärdenfors 1988, Rott 2001), and nonmonotonic reasoning (Kraus & Lehmann & Magidor 1990, Makinson 2005) qualitative approaches are used to repr...
متن کاملRanking Functions, AGM Style
Ranking functions, having their first appearance under the name „ordinale Konditionalfunktionen“ in my Habilitationsschrift submitted in 1983, had several precursors of which I was only incompletely aware, among them Shackle’s functions of potential surprise (see Shackle 1969), Rescher’s plausibility indexing (see Rescher 1976), Adams’ ε-semantics (see Adams 1975), Cohen’s inductive probabiliti...
متن کاملLearnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in machine learning. We define a model of learnability for ranking functions in a particular setting of the ranking problem known as the bipartite ranking problem, and derive a number of results in this model. Our first mai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Econometrics
سال: 2021
ISSN: ['1099-1255', '0883-7252']
DOI: https://doi.org/10.1002/jae.2832